National Repository of Grey Literature 2 records found  Search took 0.02 seconds. 
Hardware Acceleration of Longest Prefix Match
Kekely, Lukáš ; Tobola, Jiří (referee) ; Kořenek, Jan (advisor)
This bachelor's thesis describes design and implementation of hardware architecture for longest prefix match in order to achieve high throughput, which is required in today's high-speed computer networks. It is focused on IPv4 as-well-as IPv6 networks. Designed hardware architecture has throughput 75 Gbps on the shortest IPv4 and IPv6 packets.  Performance of designed architecture is also compared with performance of chosen algorithms, which are used in nowadays commercial devices. These algorithms are: Tree Bitmap, Shape-Shifting Trie and Binary Search on Prefixes. All algorithms were implemented in C language using multi-threaded processing.
Hardware Acceleration of Longest Prefix Match
Kekely, Lukáš ; Tobola, Jiří (referee) ; Kořenek, Jan (advisor)
This bachelor's thesis describes design and implementation of hardware architecture for longest prefix match in order to achieve high throughput, which is required in today's high-speed computer networks. It is focused on IPv4 as-well-as IPv6 networks. Designed hardware architecture has throughput 75 Gbps on the shortest IPv4 and IPv6 packets.  Performance of designed architecture is also compared with performance of chosen algorithms, which are used in nowadays commercial devices. These algorithms are: Tree Bitmap, Shape-Shifting Trie and Binary Search on Prefixes. All algorithms were implemented in C language using multi-threaded processing.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.